Cayley graph connected cycles: A new class of fixed-degree interconnection networks
نویسندگان
چکیده
We introduce a new class of fixed-degree interconnection networks, called the Cayley graph connected cycles , which includes the well known cube-connected cycles as a special case. This class of networks is shown to be vertexsymmetric and maximally fault tolerant (if the given Cayley graph is maximally fault tolerant). We propose simple routing and broadcasting algorithms for these networks in general, and improve them for special types of Cayley graph connected cycles having abelian generator-sets. Furthermore, the average distance in these networks is analyzed.
منابع مشابه
Principle of Symmetry for Network Topology with Applications to Some Networks
A number of Cayley-graph interconnection structures, such as cube-connected cycles, butterfly and biswapped networks, are known to be derivable by unified group semidirect product construction. In this paper, we extend these known group semidirect product constructions via a general algebraic construction based on group semidirect product. We show that under certain conditions, graphs based on ...
متن کاملCyclic-Cubes: A New Family of Interconnection Networks of Even Fixed-Degrees
We introduce a new family of interconnection networks that are Cayley graphs with xed degrees of any even number greater than or equal to 4. We call the proposed graphs cyclic-cubes because contracting some cycles in such a graph results in a generalized hypercube. These Cayley graphs have optimal fault tolerance and logarithmic diameters. For comparable number of nodes, a cyclic-cube can have ...
متن کاملComputer Science Technical Report A New Family of Cayley Graph Interconnection Networks of Constant Degree Four
We propose a new family of interconnection networks that are Cayley graphs with constant node degree 4. These graphs are regular, have logarithmic diameter and are maximally fault tolerant. We investigate different algebraic properties of these networks (including fault tolerance) and propose optimal routing algorithms. As far as we know, this is the first family of Cayley graphs of constant de...
متن کاملCayley graphs and symmetric interconnection networks
These lecture notes are on automorphism groups of Cayley graphs and their applications to optimal fault-tolerance of some interconnection networks. We first give an introduction to automorphisms of graphs and an introduction to Cayley graphs. We then discuss automorphism groups of Cayley graphs. We prove that the vertex-connectivity of edge-transitive graphs is maximum possible. We investigate ...
متن کاملSome mathematical properties of cayley digraphs with applications to interconnection network design
We consider the relationships between Cayley digraphs and their coset graphs with respect to subgroups and obtain some general results on homomorphism and broadcasting between them. We also derive a general factorization theorem on subgraphs of Cayley digraphs by their automorphism groups. We discuss the applications of these results to well-known interconnection networks such as the butterfly ...
متن کامل